MATH5165: Mathematical Logic I

4 Credits

Theory of computability: notion of algorithm, Turing machines, primitive recursive functions, recursive functions, Kleene normal form, recursion theorem. Propositional logic. prereq: 2283 or 3283 or Phil 5201 or CSci course in theory of algorithms or instr consent

View on University Catalog

All Instructors

A- Average (3.647)Most Common: A (66%)

This total also includes data from semesters with unknown instructors.

257 students
WFDCBA

  • 4.56

    /6

    Recommend

  • 5.45

    /6

    Effort

  • 4.59

    /6

    Understanding

  • 4.17

    /6

    Interesting

  • 4.54

    /6

    Activities
      Contribute on our Github

      Gopher Grades is maintained by Social Coding with data from Summer 2017 to Summer 2025 provided by the University in response to a public records request

      Not affiliated with the University of Minnesota

      Privacy Policy